By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents
Volume 17, Issue 4, pp. 521-685

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols

Michele Flammini and Stéphane Pérennès

pp. 521-540

On Local Versus Global Satisfiability

Luca Trevisan

pp. 541-547

On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property

Vu Dong Tô and Reihaneh Safavi-Naini

pp. 548-570

Radius Three Trees in Graphs with Large Chromatic Number

H. A. Kierstead and Yingxian Zhu

pp. 571-581

Minimizing Wirelength in Zero and Bounded Skew Clock Trees

Moses Charikar, Jon Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, and Andrew Tomkins

pp. 582-595

Encoding Fullerenes and Geodesic Domes

Jack E. Graver

pp. 596-614

Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints

Erik Ordentlich and Ron M. Roth

pp. 615-623

On Distributions Computable by Random Walks on Graphs

Guy Kindler and Dan Romik

pp. 624-633

Listen to Your Neighbors: How (Not) to Reach a Consensus

Nabil H. Mustafa and Aleksandar Pekec

pp. 634-660

Fractional Packing of T-Joins

Francisco Barahona

pp. 661-669

Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs

Valentino Crespi

pp. 670-674

Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over \boldmath$\mathbbZ_p$ with p Prime

C. R. Miers and F. Ruskey

pp. 675-685